Reverse Lexicographic and Lexicographic Shifting

نویسندگان

  • ERIC BABSON
  • ISABELLA NOVIK
چکیده

A short new proof of the fact that all shifted complexes are fixed by reverse lexicographic shifting is given. A notion of lexicographic shifting, ∆lex — an operation that transforms a monomial ideal of S = k[xi : i ∈ N] that is finitely generated in each degree into a squarefree strongly stable ideal — is defined and studied. It is proved that (in contrast to the reverse lexicographic case) a squarefree strongly stable ideal I ⊂ S is fixed by lexicographic shifting if and only if I is a universal squarefree lexsegment ideal (abbreviated USLI) of S. Moreover, in the case when I is finitely generated and is not a USLI, it is verified that all the ideals in the sequence {∆ lex (I)}i=0 are distinct. The limit ideal ∆(I) = limi→∞ ∆ i lex (I) is well defined and is a USLI that depends only on a certain analog of the Hilbert function of I.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ar X iv : m at h / 05 07 56 5 v 1 [ m at h . C O ] 2 7 Ju l 2 00 5 REVERSE LEXICOGRAPHIC AND LEXICOGRAPHIC SHIFTING

A short new proof of the fact that all shifted complexes are fixed by reverse lexicographic shifting is given. A notion of lexicographic shifting, ∆ lex — an operation that transforms a monomial ideal of S = k[x i : i ∈ N] that is finitely generated in each degree into a squarefree strongly stable ideal — is defined and studied. It is proved that (in contrast to the reverse lexicographic case) ...

متن کامل

Conditions for Generic Initial Ideals to Be Almost Reverse Lexicographic

Let I be a homogeneous Artinian ideal in a polynomial ring R = k[x1, . . . , xn] over a field k of characteristic 0. We study an equivalent condition for the generic initial ideal gin(I) with respect to reverse lexicographic order to be almost reverse lexicographic. As a result, we show that Moreno-Socias conjecture implies Fröberg conjecture. And for the case codimI ≤ 3, we show that R/I has t...

متن کامل

Using lexicographic parametric programming for identifying efficient hyperpalnes in DEA

This paper investigates a procedure for identifying all efficient hyperplanes of production possibility set (PPS). This procedure is based on a method which recommended by Pekka J. Korhonen[8]. He offered using of lexicographic parametric programming method for recognizing all efficient units in data envelopment analysis (DEA). In this paper we can find efficient hyperplanes, via using the para...

متن کامل

Lexicographic goal programming approach for portfolio optimization

This paper will investigate the optimum portfolio for an investor, taking into account 5 criteria. The mean variance model of portfolio optimization that was introduced by Markowitz includes two objective functions; these two criteria, risk and return do not encompass all of the information about investment; information like annual dividends, S&P star ranking and return in later years which is ...

متن کامل

Subtotal ordering -- a pedagogically advantageous algorithm for computing total degree reverse lexicographic order

Total degree reverse lexicographic order is currently generally regarded as most often fastest for computing Gröbner bases. This article describes an alternate less mysterious algorithm for computing this order using exponent subtotals and describes why it should be very nearly the same speed the traditional algorithm, all other things being equal. However, experimental evidence suggests that s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006